Aggregation and Residuation
نویسندگان
چکیده
In this note we give a characterization of meet-projections in simple atomistic lattices that generalizes results on the aggregation of partitions in cluster analysis. Documents de Travail du Centre d'Economie de la Sorbonne 2010.58 1 AGGREGATION and RESIDUATION Bruno LECLERC 1 and Bernard MONJARDET 2 Abstract In this note we give a characterization of meet-projections in simple atomistic lattices that generalizes results on the aggregation of partitions in cluster analysis.In this note we give a characterization of meet-projections in simple atomistic lattices that generalizes results on the aggregation of partitions in cluster analysis.
منابع مشابه
Aggregation and Residuation (non Final Version)
In this note we give a characterization of meet-projections in simple atomistic lattices which generalizes previous results on the aggregation of partitions obtained in a cluster analysis framework. Mathematics Subject Classifications (2010). 06A5, 6207, 91B14.
متن کاملAggregation Operators and Lipschitzian Conditions
Lipschitzian aggregation operators with respect to the natural T indistinguishability operator ET and their powers, and with respect to the residuation → T with respect to a t-norm T and its powers are studied. A t-norm T is proved to be ET -Lipschitzian and → T -Lipschitzian, and is interpreted as a fuzzy point and a fuzzy map as well. Given an Archimedean t-norm T with additive generator t, t...
متن کاملCRL-Chu Correspondences
We continue our study of the general notion of L-Chu correspondence by introducing the category CRL-ChuCors incorporating residuation to the underlying complete lattice L, specifically, on the basis of a residuation-preserving isotone Galois connection λ. Then, the L-bonds are generalized within this same framework, and its structure is related to that of the extent of a suitably defined λ-dire...
متن کاملResiduation and Guarded Rules for Constraint Logic Programming
A major difficulty with logic programming is combinatorial explosion: since goals are solved with possibly indeterminate (i.e., branching) reductions, the resulting search trees may grow wildly. Constraint logic programming systems try to avoid combinatorial explosion by building in strong determinate (i.e., non-branching) reduction in the form of constraint simplification. In this paper, we pr...
متن کاملFree Lukasiewicz and Hoop Residuation Algebras
Hoop residuation algebras are the {→, 1}-subreducts of hoops; they include Hilbert algebras and the {→, 1}-reducts of MV-algebras (also known as Wajsberg algebras). The paper investigates the structure and cardinality of finitely generated algebras in varieties of kpotent hoop residuation algebras. The assumption of k-potency guarantees local finiteness of the varieties considered. It is shown ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Order
دوره 30 شماره
صفحات -
تاریخ انتشار 2013